Adaptive REM: random exponential marking with improved robustness
نویسندگان
چکیده
Introduction: As a representative active queue management (AQM) scheme, random exponential marking (REM) [1] faces the challenge of dynamically tuning its parameters to satisfy the stability requirement under various network conditions adaptive to network conditions [2, 3]. In [4], Deng et al. proposed an adaptive control mechanism for the proportional and integral (PI) controller based AQM (PI-AQM) developed in [3]. The mechanism improves system stability and performance under changing network conditions by applying an update function to the packet dropping probability. Unfortunately, although REM also belongs to the family of PI controllers [4], due to the fact that the proportional control gain KP of REM is a decreasing function of the equilibrium point of marking probability, the mechanism proposed in [4] is not suitable to enable REM to adapt its control parameters to the changing of network conditions. To improve the robustness of REM, in this Letter we propose to apply an update function to the dynamics of the price in REM. The enhanced REM, termed as ‘adaptive REM’, can adapt its control parameters to various network conditions.
منابع مشابه
GA-PSO-Optimized Neural-Based Control Scheme for Adaptive Congestion Control to Improve Performance in Multimedia Applications
Active queue control aims to improve the overall communication network throughput, while providing lower delay and small packet loss rate. The basic idea is to actively trigger packet dropping (or marking provided by explicit congestion notification (ECN)) before buffer overflow. In this paper, two artificial neural networks (ANN)-based control schemes are proposed for adaptive queue control in...
متن کاملLocal stability of random exponential marking - Communications, IEE Proceedings-
Random exponential marking (REM) is an attractive adaptive queue management algorithm. It uses the quantity known as ‘price’ to measure the congestion in a network. REM can achieve high utilisation, small queue length, and low buffer overflow probability. Many works have used control theory to provide the stable condition of REM without considering the feedback delay. Recently, sufficient condi...
متن کاملSimulation comparison of RED and REM
We propose earlier an optimization based low control for the Internet called Random Exponential Marking (REM). REM consists of a link algorithm, that probabastically marks packets inside the network, and a source algorithm, that adapts source rate to observed marking. The marking probability is exponential in a link congestion measure, so that the e&-tc-end marking probability is exponential in...
متن کاملRandom Early Marking
| Random Early Marking (REM) consists of a link algorithm, that probabilistically marks packets inside the network, and a source algorithm, that adapts source rate to observed marking. The marking probability is exponential in a link congestion measure, so that the end{to{end marking probability is exponential in a path congestion measure. Marking allows a source to estimate its path congestion...
متن کاملOptimization Flow Control, Ii: Implementation
A duality model of ow control is proposed in Part I of this paper and leads to a basic ow control algorithm. In this sequel we develop a practical implementation of the basic algorithm, Random Exponential Marking (REM). It consists of a link algorithm, that probabilistically marks packets inside the network, and a source algorithm, that adapts source rate to observed marking. REM has three adva...
متن کامل